A semi-supervised version of heteroscedastic linear discriminant analysis
نویسندگان
چکیده
Heteroscedastic Linear Discriminant Analysis (HLDA) was introduced in [1] as an extension of Linear Discriminant Analysis to the case where the class-conditional distributions have unequal covariances. The HLDA transform is computed such that the likelihood of the training (labeled) data is maximized, under the constraint that the projected distributions are orthogonal to a nuisance space that does not offer any discrimination. In this paper we consider the case of semi-supervised learning, where a large amount of unlabeled data is also available. We derive update equations for the parameters of the projected distributions, which are estimated jointly with the HLDA transform, and we empirically compare it with the case where no unlabeled data are available. Experimental results with synthetic data and real data from a vowel recognition task show that, in most cases, semi-supervised HLDA results in improved performance over HLDA.
منابع مشابه
Heteroscedastic Probabilistic Linear Discriminant Analysis with Semi-supervised Extension
Linear discriminant analysis (LDA) is a commonly used method for dimensionality reduction. Despite its successes, it has limitations under some situations, including the small sample size problem, the homoscedasticity assumption that different classes have the same Gaussian distribution, and its inability to produce probabilistic output and handle missing data. In this paper, we propose a semi-...
متن کاملSemi-supervised bipartite ranking with the normalized Rayleigh coefficient
We propose a new algorithm for semi-supervised learning in the bipartite ranking framework. It is based on the maximization of a so-called normalized Rayleigh coefficient, which differs from the usual Rayleigh coefficient of Fisher’s linear discriminant in that the actual covariance matrices are used instead of the scatter matrices. We show that if the class conditional distributions are Gaussi...
متن کاملSpectral Methods for Linear and Non-Linear Semi-Supervised Dimensionality Reduction
We present a general framework of spectral methods for semi-supervised dimensionality reduction. Applying an approach called manifold regularization, our framework naturally generalizes existent supervised frameworks. Furthermore, by our two semi-supervised versions of the representer theorem, our framework can be kernelized as well. Using our framework, we give three examples of semi-supervise...
متن کاملOn the relation between discriminant analysis and mutual information for supervised linear feature extraction
This paper provides a unifying view of three discriminant linear feature extraction methods: Linear Discriminant Analysis, Heteroscedastic Discriminant Analysis and Maximization of Mutual Information. We propose a model-independent reformulation of the criteria related to these three methods that stresses their similarities and elucidates their differences. Based on assumptions for the probabil...
متن کاملSemi-Supervised Based Hyperspectral Imagery Classification
Hyperspectral imagery classification is a challenging problem. Wherein, the high number of spectral channels and the high cost of true sample labeling greatly reduce the classification precision. In this paper, we proposed a semi-supervised method, which combine linear discriminant analysis and manifold learning, to improve the precision of hyperspectral imagery classification. Experimental res...
متن کامل